Efficient Vector Influence Clustering Coefficient Based Directed Community Detection Method
نویسندگان
چکیده
منابع مشابه
Clustering and Community Detection in Directed Networks: A Survey
Networks (or graphs) appear as dominant structures in diverse domains, including sociology, biology, neuroscience and computer science. In most of the aforementioned cases graphs are directed – in the sense that there is directionality on the edges, making the semantics of the edges non symmetric as the source node transmits some property to the target one but not vice versa. An interesting fea...
متن کاملA Greedy Community-Mining Algorithm Based on Clustering Coefficient
A community in a large, real-life network, such as the World Wide Web (Web), has been broadly defined as a group of nodes that are densely linked with each other, while being sparsely linked with the rest of the nodes. In the last 2-3 years, community-mining in such networks has emerged as a problem of great practical significance. This problem has been framed in at least two different versions...
متن کاملEfficient Link Prediction with Node Clustering Coefficient
Predicting missing links in incomplete complex networks efficiently and accurately is still a challenging problem. The recently proposed CAR (Cannistrai-Alanis-Ravai) index shows the power of local link/triangle information in improving link-prediction accuracy. With the information of level-2 links, which are links between common-neighbors, most classical similarity indices can be improved. Ne...
متن کاملEfficient test compaction for combinational circuits based on Fault detection count-directed clustering
Test compaction is an effective technique for reducing test data volume and test application time. In this paper, we present a new static test compaction algorithm based on test vector decomposition and clustering. Test vectors are decomposed and clustered in an increasing order of faults detection count. This clustering order gives more degree of freedom and results in better compaction. Exper...
متن کاملData-Based Influence Maximization using Community Detection
Influence maximization is the problem of finding a set of users in a social network, such that by targeting this set, one maximizes the expected spread of influence in the network .In this work, I am proposing a new algorithm drawing inspiration from the works done in the same field by [9] and [10]. The main motive behind this work is to emulate the relationship between the fields of Community ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2017
ISSN: 2169-3536
DOI: 10.1109/access.2017.2740962